Improved Approximation Algorithms for Firefighter Problem on Trees
نویسندگان
چکیده
منابع مشابه
The firefighter problem with more than one firefighter on trees
In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several open questions of [8]. More precisely, when b ≥ 2 firefighters are allowed at each time step, the problem is NP-complete for trees of maximum degree b+2 and polynomial-time solvable for trees of maximum degree b + 2 when...
متن کاملApproximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
We provide approximation algorithms for several variants of the Firefighter problem on general graphs. The Firefighter problem models the case where an infection or another diffusive process (such as an idea, a computer virus, or a fire) is spreading through a network, and our goal is to stop this infection by using targeted vaccinations. Specifically, we are allowed to vaccinate at most B node...
متن کاملImproved Approximation Algorithms for the Matroid Median Problem
We consider the matroid median problem (MMP), which is defined as follows. As in the uncapacitated facility location problem, we are given a set of facilities F and a set of clients D. Each facility i has an opening cost of fi. Each client j ∈ D has demand dj and assigning client j to facility i incurs an assignment cost of djcij proportional to the distance between i and j. Further, we are giv...
متن کاملImproved Approximation Algorithms for the Capacitated Multicast Routing Problem
For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is the best approximation ratio for the Steiner Tree problem, and is about 1.55), respectively, thus improving upon the previous b...
متن کاملImproved Approximation Algorithms for the Max-Edge Coloring Problem
The Max Edge-Coloring (MEC) problem is a natural weighted generalization of the classical edgecoloring problem. Formally, in the MEC problem we are given a graph G = (V,E) with a weight function w : E → N , and we ask for a proper edge-coloring of G, M = {M1,M2, . . . ,Mk}, such that the sum of the weights of the heaviest edges in the color classes, W = ∑k i=1max{w(e)|e ∈ Mi}, is minimized. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2011
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e94.d.196